System reliability for quickest path problems under time threshold and budget
نویسندگان
چکیده
منابع مشابه
Reliability Evaluation of Stochastic-Flow Network under Quickest Path and System Capacity Constraints
This paper proposes an algorithm to evaluate the probability that d units of data can be sent from the source node to the sink node through a valid group of paths on a network. The conditions of transmission are such that the transmission time of each path belonging to this valid group of paths does not exceed the specified upper bound T, and that the maximal capacity of that path is not less t...
متن کاملMin-Max quickest path problems
In a dynamic network, the quickest path problem asks for a path such that a given amount of flow can be sent from source to sink via this path in minimal time. In practical settings, for example, in evacuation or transportation planning, the problem parameters might not be known exactly a priori. It is therefore of interest to consider robust versions of these problems in which travel times and...
متن کاملReliable and Restricted Quickest Path Problems
In a dynamic network, the quickest path problem asks for a path minimizing the time needed to send a given amount of flow from source to sink along this path. In practical settings, for example in evacuation or transportation planning, the reliability of network arcs depends on the specific scenario of interest. In this circumstance, the question of finding a quickest path among all those havin...
متن کاملReliability Evaluation of Multi-source Multi- Sink Stochastic-flow Networks under Quickest Path and System Capacity Constraints
A multi-source multi-sink stochastic-flow network consists of a set of nodes, including sources nodes si that supply resources and sink nodes tj where demands are realized, and a set of directed arcs that carry resource flows. This paper presents an algorithm to determine the probability, called system reliability ( T C d ij wj R ), that for each source–sink pair (si, tj), dwj (the demand for r...
متن کاملExtend the quickest path problem to the system reliability evaluation for a stochastic-flow network
From the point of view of quality management, it is an important issue to reduce the transmission time in the network. The quickest path problem is to 6nd the path in the network to send a given amount of data from the source to the sink such that the transmission time is minimized. Traditionally, this problem assumed that the capacity of each arc in the network is deterministic. However, the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.08.026